Linear Higher-Order Matching Is NP-Complete
نویسنده
چکیده
We consider the problem of higher-order matching restricted to the set of linear λ-terms (i.e., λ-terms where each abstraction λx.M is such that there is exactly one free occurrence of x in M). We prove that this problem is decidable by showing that it belongs to NP. Then we prove that this problem is in fact NP-complete. Finally, we discuss some heuristics for a practical algorithm.
منابع مشابه
On the Complexity of Higher-Order Matching in the Linear λ-Calculus
We prove that linear second-order matching in the linear λcalculus with linear occurrences of the unknowns is NP-complete. This result shows that context matching and second-order matching in the linear λ-calculus are, in fact, two different problems.
متن کاملHigher-Order Matching in the Linear λ-calculus with Pairing
We prove that higher-order matching in the linear λ-calculus with pairing is decidable. We also establish its NP-completeness under the assumption that the right-hand side of the equation to be solved is given in normal form.
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملOn the Uniication Problem for Cartesian Closed Categories
Cartesian closed categories (CCC's) have played and continue to play an important role in the study of the semantics of programming languages. An axiomatiza-tion of the isomorphisms which hold in all Cartesian closed categories discovered independently by Soloviev and Bruce and Longo leads to seven equalities. We show that the uniication problem for this theory is undecidable, thus settling an ...
متن کاملDeterministic second-order patterns
Second-order patterns, together with second-order matching, enable concise specification of program transformation, and have been implemented in several program transformation systems. However, second-order matching in general is nondeterministic, and the matching algorithm is so expensive that the matching is NP-complete. It is orthodox to impose constraints on the form of higher-order pattern...
متن کامل